Scarecrow: If I only had AI

نویسندگان

  • David P. Miller
  • Jacob Q. Milstein
  • Cathryne Stein
چکیده

At the 1992 AAAI robot contest one of the top finishers was Scarecrow – a robot that had no computer in the traditional sense, was built out of less than $200 of parts, and was explained and operated by a five year old. The designers sought to demonstrate the capabilities and competence that can be accomplished by using a strictly reactive architecture for well defined tasks such as that contest. This paper reexamines the Scarecrow robot and puts it into historical context. With fifteen years of perspective, we can also see what Scarecrow has to say about the perception of intelligence. 1 Finding the Tall Poles in a Problem Space In 1992 AAAI held the first of its annual robotics contests. The contest that year was to find, and then visit in order, a set of tall poles in a physical problem space. A set of ten 10’ tall 4” diameter pieces of PVC were placed vertically inside of a 40’ diameter arena. Inside the arena were cardboard box obstacles, approximately 1 × 2 × 3 foot set on their 1 × 3 side. Approximately fifty boxes were in the arena. The challenge to the robots in round one was to visit each of the poles and ID each pole (or create a unique ID for that pole). In round two robots were required to visit, in order, a set of three poles (selected by the judges) that the robot had previously identified. Teams were allowed to place identifying markers (e.g., bar codes) on the poles in advance. A robot was judged to have visited a pole if it correctly identified a pole while simultaneously coming within two robot diameters of that pole. A robot successfully avoided an obstacle if it turned away from an obstacle rather than attempting to plow through it. ∗with apologies to Mssrs. Harburg & Arlen: I could suck up amps of power; Computing for many hours; Making models verify; And my inferences would be seizing; While my memory was GC’ing; If I only had AI †School of Aerospace & Mechanical Engineering, University of Oklahoma, Norman, OK. [email protected] ‡Wesleyan University, Middletown, CT §KISS Institute for Practical Robotics, Norman OK

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introduction to the special issue on the science behind embodied AI : The robots of the AAAI competition and exhibition

Welcome to the special issue of Autonomous Robots devoted to the topic of The Science Behind Embodied AI : The Robots of the AAAI Competition and Exhibition. The robotics competition held at the annual conference of the American Association for Artificial Intelligence (AAAI) was first held in 1993 as a way to help promote the science of embodied AI as illustrated by the use of robotics. The com...

متن کامل

On the distinctness of binary sequences derived from $2$-adic expansion of m-sequences over finite prime fields

Let p be an odd prime with 2-adic expansion ∑k i=0 pi · 2 . For a sequence a = (a(t))t≥0 over Fp, each a(t) belongs to {0, 1, . . . , p − 1} and has a unique 2-adic expansion a(t) = a0(t) + a1(t) · 2 + · · ·+ ak(t) · 2 , with ai(t) ∈ {0, 1}. Let ai denote the binary sequence (ai(t))t≥0 for 0 ≤ i ≤ k. Assume i0 is the smallest index i such that pi = 0 and a and b are two different m-sequences ge...

متن کامل

Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold?

Factor analysis is a basic tool in statistics and machine learning, where the goal is to take many variables and explain them away using fewer unobserved variables, called factors. It was introduced in a pioneering study by psychologist Charles Spearman, who used it to test his theory that there are fundamentally two types of intelligence – verbal and mathematical. This study has had a deep inf...

متن کامل

Scientific DataLink's Artificial Intelligence Classification Scheme

About a year ago, I was approached by I’hocbe Huang of Comtex Scientific Corporation who hoped t,hat I would help devise a dramatically expanded index for topics in AI, to aid Comtex in indexing the series of AI memos and reports that they had been gathering. Comtex had tried to get the ACM to expand and update its classification, but was told that ACM had just revised the listing two years or ...

متن کامل

A Study of Graphical Permutations

A STUDY OF GRAPHICAL PERMUTATIONS by Jessica Thune Dr. Michelle Robinette, Examination Committee Chair Associate Professor of Mathematics University of Nevada, Las Vegas A permutation π on a set of positive integers {a1, a2, ..., an} is said to be graphical if there exists a graph containing exactly ai vertices of degree π(ai) for each i (1 ≤ i ≤ n). It has been shown that for positive integers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Auton. Robots

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2007